Complete square complexes

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automata and Square Complexes.

We introduce a new geometric tool for analyzing groups of finite au-tomata. To each finite automaton we associate a square complex. The square complex is covered by a product of two trees iff the automaton is bi-reversible. Using this method we give examples of free groups and of Kazhdan groups which are generated by the different states of one finite (bi-reversible) automaton. We also reproduc...

متن کامل

Groups Acting on CAT (0) Square Complexes

We study groups acting on CAT (0) square complexes. In particular we show if Y is a nonpositively curved (in the sense of A. D. Alexandrov) finite square complex and the vertex links of Y contain no simple loop consisting of five edges, then any subgroup of π1(Y ) either is virtually free abelian or contains a free group of rank two. In addition we discuss when a group generated by two hyperbol...

متن کامل

On Complexes of Finite Complete Intersection Dimension

We study complexes of finite complete intersection dimension in the derived category of a local ring. Given such a complex of complexity c, we prove that the thick subcategory it generates contains complexes of all possible complexities at most c. In particular, we show that such a complex is virtually small, answering a question raised by Dwyer, Greenlees and Iyengar.

متن کامل

Fuzzy complexes: Specific binding without complete folding.

Specific molecular recognition is assumed to require a well-defined set of contacts and devoid of conformational and interaction ambiguities. Growing experimental evidence demonstrates however, that structural multiplicity or dynamic disorder can be retained in protein complexes, termed as fuzziness. Fuzzy regions establish alternative contacts between specific partners usually via transient in...

متن کامل

Recognition of collapsible complexes is NP-complete

We prove that it is NP-complete to decide whether a given (3-dimensional) simplicial complex is collapsible. This work extends a result of Malgouyres and Francés showing that it is NP-complete to decide whether a given simplicial complex collapses to a 1-complex.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Commentarii Mathematici Helvetici

سال: 2007

ISSN: 0010-2571

DOI: 10.4171/cmh/107